Partial Random Walks For Transient Analysis of Large Power Distribution Networks∗
نویسندگان
چکیده
This paper proposes a new simulation algorithm for analyzing large power distribution networks, modeled as linear RLC circuits, based on a novel partial random walk concept. The random walk simulation method has been shown to be an efficient way to solve for voltages of small number of nodes in a large power distribution network [2], but the algorithm becomes expensive to solve for voltages of nodes that are more than a few with high accuracy. In this paper, we combine direct methods like LU factorization with the random walk concept to solve power distribution networks when voltage waveforms from a large number of nodes are required. We extend the random walk algorithm to deal with general RLC networks and show that Norton companion models for capacitors and self-inductors are more amenable for transient analysis by using random walks than Thevenin companion models. We also show that by nodal analysis (NA) formulation for all the voltage sources, LU-based direct simulations of subcircuits can be speeded up. Experimental results demonstrate that the resulting algorithm, called partial random walk (PRW), has significant advantages over the existing random walk method especially when the VDD/GND nodes are sparse and accuracy requirement is high. key words: Random Walks, On-Chip Power Distribution, Simulation, Power/Ground Networks
منابع مشابه
Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence.
In general, the power-law degree distribution has profound influence on various dynamical processes defined on scale-free networks. In this paper, we will show that power-law degree distribution alone does not suffice to characterize the behavior of trapping problems on scale-free networks, which is an integral major theme of interest for random walks in the presence of an immobile perfect abso...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملPower System Transient Stability Analysis Based on the Development and Evaluation Methods
A novel method to compute the stability region in power system transient stability analysis is presented. This method is based on the set analysis. The key to this method is to construct the Hamilton-Jacobi-Isaacs (HJI) partial differential equation (PDE) of a nonlinear system, using which we can compute the backward reachable set by applying the level set methods. The backward reachable set of...
متن کاملChallenges for Routing and Search in Dynamic and Self-organizing Networks
Search methods in self-organizing networks usually cannot rely on stable topology from which shortest or otherwise optimized paths through the network are derived. When no reliable search indices or routing tables are available, other methods like flooding or random walks have to be considered to explore the network. These approaches can exploit partial knowledge in the network to reach a desti...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کامل